programming algorithmの例文

• Rivas and Eddy published a dynamic programming algorithm for predicting pseudoknots.
• Earley's algorithm is a top-down dynamic programming algorithm.
• However, this dynamic programming algorithm is very slow.
• Dynamic programming algorithms are often used for optimization.
• I realize there is a fast dynamic programming algorithm, but it still seems mightily costly.
• The
  鹯st and the most popular method for finding the most stable structure is a dynamic programming algorithm.
• Also, relativistic programming algorithms are designed to work without the presences of a global order of events.
• The profile is moved along the target sequence to locate the best scoring regions by a dynamic programming algorithm.
• Dynamic programming algorithms provide a means to implicitly check all variants of possible RNA secondary structures without explicitly generating the structures.
• In 1991, Emo Welzl proposed a much simpler randomized algorithm based in the extension of R . Seidel randomized linear programming algorithm.
• Using this cost function, we can write a dynamic programming algorithm to find the fastest way to concatenate a sequence of strings.
• A dynamic programming algorithm will examine the previously solved subproblems and will combine their solutions to give the best solution for the given problem.
• On modern computers solving the problem for up to something like 20 points can actually be done by a relatively simple dynamic programming algorithm.
• A linear programming algorithm finds a point in the polyhedron where this function has the smallest ( or largest ) value if such a point exists.
• Certainly if you do a web search for something like " interview questions programming algorithms ", you'll find a large number of puzzles.
• In 1971, Knuth published a relatively straightforward dynamic programming algorithm capable of constructing the statically optimal tree in only O ( n 2 ) time.
• Since the dual maximization problem is a quadratic function of the c _ i subject to linear constraints, it is efficiently solvable by quadratic programming algorithms.
• As with a sequence profile, the structural profile is moved along a target sequence to find the highest possible alignment score by a dynamic programming algorithm.
• At an iterate x _ k, a basic sequential quadratic programming algorithm defines an appropriate search direction d _ k as a solution to the quadratic programming subproblem
• If " P " ( the number of place values ) is a small fixed number, then there are dynamic programming algorithms that can solve it exactly.